A Set-Theoretic Blind Image Deconvolution Based on Hybrid Steepest Descent Method

نویسندگان

  • Masanori KATO
  • Isao YAMADA
  • Kohichi SAKANIWA
چکیده

Recently, Kundur and Hatzinakos showed that a linear restoration filter designed by using the almost obvious a priori knowledge on the original image, such as (i) nonnegativity of the true image and (ii) the smallest rectangle encompassing the original object, can realize a remarkable performance for a blind image deconvolution problem. In this paper, we propose a new set-theoretic blind image deconvolution scheme based on a recently developed convex projection technique called Hybrid Steepest Descent Method (HSDM), where some partial information can be utilized set-theoretically by parallel projections onto convex sets while the others are incorporated in a cost function to be minimized by a steepest descent method. Numerical comparisons with the standard set-theoretic scheme based on POCS illustrate the effectiveness of the proposed scheme. key words: blind image restoration, blind image deconvolution, convex projection, hybrid steepest descent method

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An optimal set-theoretic blind deconvolution scheme based on hybrid steepest descent method

In this paper, we propose a simple set theoretic blind deconvolution scheme based on a recently developed convex projection technique called Hybrid Steepest Descent Methods. The scheme is essentially motivated by Kundur and Hatzinakos’s idea that minimizes a certain cost function uniformly reflecting all a priori information such that (i) nonnegativity of the true image and (ii) support size of...

متن کامل

Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold

In this paper, we propose a Riemannian steepest descent method for solving a blind deconvolution problem. We prove that the proposed algorithm with an appropriate initialization will recover the exact solution with high probability when the number of measurements is, up to log-factors, the information-theoretical minimum scaling. The quotient structure in our formulation yields a simpler penalt...

متن کامل

Hybrid steepest-descent method with sequential and functional errors in Banach space

Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...

متن کامل

Gradient-Based Blind Deconvolution with Flexible Approximated Bayesian Estimator

In this paper a new blind deconvolution algorithm as modzjkation of the Bellini ‘s ‘Bussgang ’ is presented. Firstly, a novel version based on stochastic Gradient Steepest Descent error minimization technique isproposed. Then the Bayesian estimator used by Bellini is approximated with a flexible Sigmoid’ parameterized with adjustable amplitude and slope, and a gradient-based technique is propos...

متن کامل

PSO-Optimized Blind Image Deconvolution for Improved Detectability in Poor Visual Conditions

Abstract: Image restoration is a critical step in many vision applications. Due to the poor quality of Passive Millimeter Wave (PMMW) images, especially in marine and underwater environment, developing strong algorithms for the restoration of these images is of primary importance. In addition, little information about image degradation process, which is referred to as Point Spread Function (PSF...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999